Domain Decomposition (dd) Methods
نویسندگان
چکیده
This short paper gives a review of domain decomposition methods for parallel computations of large scale problems, with a focus on computational geology.
منابع مشابه
Parallel domain decomposition simulation for large-scale power grid
This paper presents a fully parallelized domain decomposition (DD) technique for efficient simulation of large-scale linear circuits such as power grids. Domain decompositions using non-overlapping and overlapping partitions are developed to conquer the numerical difficulties in simulation. Experimental results show that by the proposed parallel DD framework, existing linear circuit simulators ...
متن کاملDomain decomposition methods with overlapping subdomains for time-dependent problems
Domain decomposition (DD) methods for solving time-dependent problems can be classified by (i) the method of domain decomposition used, (ii) the choice of decomposition operators (exchange of boundary conditions), and (iii) the splitting scheme employed. To construct homogeneous numerical algorithms, overlapping subdomain methods are preferable. Domain decomposition is associated with the corre...
متن کاملPreprocessing for 2d Fe{be Domain Decomposition Methods
The non-overlapping Domain Decomposition (DD) method is a powerful tool for the coupling of Finite Element (FE) and Boundary Element (BE) methods. Moreover it provides a natural basis for constructing eecient parallel solvers. However, both, the eeciency and the robustness of DD{solvers depends heavily on the underlying decomposition of the domain of interest into subdomains. In this paper, we ...
متن کاملDomain Decomposition vs
Domain Decomposition (DD) techniques are not only the basic tools for data partitioning but also methods for constructing new parallel pde solvers. Domain Decomposition, mesh adaption and load balance seem to be in contradiction to the eecient use of massively parallel computers with serveral hundered, or even several thousand powerful, distributed memory processors. In the case of plane bounda...
متن کاملA modified Chebyshev pseudospectral DD algorithm for the GBH equation
In this paper, a Chebyshev spectral collocation domain decomposition (DD) semidiscretization by using a grid mapping, derived by Kosloff and Tal-Ezer in space is applied to the numerical solution of the generalized Burger’s–Huxley (GBH) equation. To reduce roundoff error in computing derivatives we use the above mentioned grid mapping. In this work, we compose the Chebyshev spectral collocation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010